Weighted Hamming Metric Structures
نویسنده
چکیده
A weighted Hamming metric is introduced in [4] and it showed that the binary generalized Goppa code is a perfect code in some weighted Hamming metric. In this paper, we study the weight structures which admit the binary Hamming code and the extended binary Hamming code to be perfect codes in the weighted Hamming metric. And, we also give some structures of a 2-perfect code and how to construct a 2-perfect code in some weighted Hamming metric.
منابع مشابه
The Digital Fingerprinting Method for Static Images Based on Weighted Hamming Metric and on Weighted Container Model
The algorithm of fingerprint constructing for still images based on weighted image structure model is proposed. The error correcting codes that are perfect in weighted Hamming metric are used as a base for fingerprint constructing.
متن کاملClass of Binary Generalized Goppa Codes Perfect in Weighted Hamming Metric
The class of the binary generalized Goppa codes is offered. It is shown that the codes of this class are on the Hamming bound constructed for a weighted metric.
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملWeighted codes in Lee metrics
Perfect weighted coverings of radius one have been often studied in the Hamming metric. In this paper, we study these codes in the Lee metric. To simplify the notation, we use a slightly different description, yet equivalent. Given two integers a and b , an (a, b)-code is a set of vertices such that vertices in the code have a neighbours in the code and other vertices have b neighbours in the c...
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.01073 شماره
صفحات -
تاریخ انتشار 2018